On the speed of convergence of the total step iterative method for a class of interval linear algebraic systems
نویسنده
چکیده
"I=1,',1 HteKIITO]~II'It MHt)~K~C'I'I~I Iltl'l'epB~l;ll,lll~IX CII(=I't~M :IIIHCliHI~IX IIdlI'~I};I|ItleCKIIX yp;ll~Hl~'llllil ;IOK;I:I~II'III (:()l~.ll;121eI-Ille ~I('HMIITIIT|IHeCKIII'() ~ ; l l ' l ' ( )p ; I (,~XI)JIII.M(~?I'II II()JIHOI[I;II'()I~)III IITfp;IIIIIIIIHHIII(I Xltdll);(;I VII (:IICK"rp;l.'lbHl~tM pa.~lllyCt)M .MlljlydlH M;l ' l 'p |fl tbl IIHTepl~ldlld-ll,IX KII~,~IIIILIIeH'I'IIB.
منابع مشابه
On the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملA new iteration method for solving a class of Hammerstein type integral equations system
In this work, a new iterative method is proposed for obtaining the approximate solution of a class of Hammerstein type Integral Equations System. The main structure of this method is based on the Richardson iterative method for solving an algebraic linear system of equations. Some conditions for existence and unique solution of this type equations are imposed. Convergence analysis and error bou...
متن کاملSolving systems of nonlinear equations using decomposition technique
A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...
متن کاملComparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملOn the convergence speed of artificial neural networks in the solving of linear systems
Artificial neural networks have the advantages such as learning, adaptation, fault-tolerance, parallelism and generalization. This paper is a scrutiny on the application of diverse learning methods in speed of convergence in neural networks. For this aim, first we introduce a perceptron method based on artificial neural networks which has been applied for solving a non-singula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Reliable Computing
دوره 2 شماره
صفحات -
تاریخ انتشار 1996